Triangle-free graphs that are signable without even holes
نویسندگان
چکیده
We characterize triangle-free graphs for which there exists a subset of edges that intersects every chordless cycle in an odd number of edges (TF odd-signable graphs). These graphs arise as building blocks of a decomposition theorem (for cap-free odd-signable graphs) obtained by the same authors. We give a polytime algorithm to test membership in this class. This algorithm is itself based on a decomposition theorem. ß 2000 John Wiley & Sons, Inc. J Graph Theory 34: 204±220, 2000
منابع مشابه
Even and odd holes in cap-free graphs
It is an old problem in graph theory to test whether a graph contains a chordless cycle of length greater than three (hole) with a specific parity (even, odd). Studying the structure of graphs without odd holes has obvious implications for Berge’s strong perfect graph conjecture that states that a graph G is perfect if and only if neither G nor its complement contain an odd hole. Markossian, Ga...
متن کاملStructure and algorithms for (cap, even hole)-free graphs
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph G has a ...
متن کاملTriangle-free strongly circular-perfect graphs
Zhu [15] introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G) ≤ ω(G)+1. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs [4]; in particular, perfect graphs are closed under complementation [7]. In...
متن کاملColoring graphs with no even holes ≥ 6: the triangle-free case
In this paper, we prove that the class of graphs with no triangle and no induced cycle of even length at least 6 has bounded chromatic number. It is well-known that even-hole-free graphs are χ-bounded but we allow here the existence of C4. The proof relies on the concept of Parity Changing Path, an adaptation of Trinity Changing Path which was recently introduced by Bonamy, Charbit and Thomassé...
متن کاملDetecting even holes
Conforti, Cornuéjols, Kapoor and Vušković [4] gave a 73-page polynomial time algorithm to test whether a graph has an induced subgraph that is a cycle of even length. Here we provide another algorithm to solve the same problem. The differences are: 1. Our algorithm is simpler — we are able to search directly for even holes, while the algorithm of [4] made use of a structure theorem for even-hol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2000